| 翻訳と辞書 |
| Chore division ： ウィキペディア英語版 |
Chore division
Chore division is a fair division problem that deals with dividing chores, known as resources, evenly among a number of people, known as players. This evenness, known as envy-freeness, is a central part of fair division, because it focuses on each person's preferences such that no one feels jealous of any other player's situation.
The fair cake-cutting problem is another fair division problem that is very similar to chore division. Both problems have heterogeneous resources, meaning that the resources are nonuniform. In cake division, cakes can have edge, corner, and middle pieces along with different amounts of frosting. Whereas in chore division, there are different chore types and different amounts of time needed to finish each chore. The problems differ, however, in the desirability of the resources. In chore division, the chores are undesirable to the players, and in cake division, the cake pieces are desirable to the players.
Typically with chore division, it is assumed that the chores can be infinitely divisible, because the finite set of chores can be partitioned by chore or by time. For example, a load of laundry could be partitioned by the number of articles of clothing and/or by the amount of time spent loading the machine.〔
Chore division, also called the dirty work problem,〔Jack Robertson and William Webb (1998). ''Cake-Cutting Algorithms: Be Fair If You Can'', AK Peters Ltd, . ISBN 1-56881-076-8〕 was originally introduced in "Aha! Insight" by Martin Gardner in 1978.
==Applications==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Chore division」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|